/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 86183
 * Date: 2024-01-12
 * Time: 11:55
 */
public class Test {
    public static void fun(int n){
        if(n==0){
            return ;
        }
        int m=n%10;
        fun(n/10);
        System.out.print(m+" ");

    }
    public static int fun1(int n){
        if(n<10){
            return n;
        }
        return n%10+fun1(n/10); 
    }
    public void fun(){
        if(root==null){
            return ;
        }
        if(root.left==null&&rotot.right==null){
            return 1;
        }
        fun(root.left;
         fun(root.right);
    }
    public void fn(){
        if(root==null){
            return 0;
        }
        if(k==1){
            return count++;
        }
        fn(root.left,k--);
        fn(root.right,k--);
    }
    public int fun1(){
        if(rot==null){
            return 0;
        }
        if(fun(root.left)>fun(root..right)){
            return fun(rotot.left)+1;
        }else{
            return fun(root.right)+1;
        }
        public Node find(Root root,int val){
            if(root==null){
                return null;
            }
            if(root.val==val){
                return root;
            }
            find(root.left,val);
            find(root.right,val);
            return  null;
        }
    }
    public static void main(String[] args) {
        fun(123);

    }
}
